New lower bounds for certain classes of bin packing algorithms
نویسندگان
چکیده
منابع مشابه
New Classes of Lower Bounds for Bin Packing Problems
The bin packing problem is one of the classical NP-hard optimization problems. Even though there are many excellent theoretical results, including polynomial approximation schemes, there is still a lack of methods that are able to solve practical instances optimally. In this paper, we present a fast and simple generic approach for obtaining new lower bounds, based on dual feasible functions. Wo...
متن کاملNew classes of fast lower bounds for bin packing problems
The bin packing problem is one of the classical NP-hard optimization problems. In this paper, we present a simple generic approach for obtaining new fast lower bounds, based on dual feasible functions. Worst-case analysis as well as computational results show that one of our classes clearly outperforms the previous best “economical” lower bound for the bin packing problem by Martello and Toth, ...
متن کاملNew bin packing fast lower bounds
In this paper, we address the issue of computing fast lower bounds for the Bin Packing problem, i.e., bounds that have a computational complexity dominated by the complexity of ordering the items by non-increasing values of their volume. We introduce new classes of fast lower bounds with improved asymptotic worst-case performance compared to well-known results for similar computational effort. ...
متن کاملLower bounds for several online variants of bin packing
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.
متن کاملConstructive algorithms and lower bounds for guillotine cuttable orthogonal bin packing problems
The d-dimensional bin packing problem (OBPP-d) is the problem of finding the minimum number of containers needed to contain a set of orthogonally packed d-dimensional rectangular boxes. In OBPP-d solvers two subproblems are crucial: Calculating lower bounds and solving the decision problem (OPP-d) of determining if a set of boxes can be orthogonally packed into a single container. This thesis f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.04.017